On primitive 2-closed permutation groups of rank at most four

Primitive Permutation Groups of Finite Morley Rank

We prove a version of the O'Nan-Scott Theorem for detinably primitive permutation groups of finite Morley rank. This yields questions about structures of finite Morley rank of the form (F, + , . , / / ) where (F, +,.) is an algebraically closed field and H is a central extension of a simple group with /Y=sGL(rt, F). We obtain partial results on such groups H, and show for example that if char(/...

Distinguishing Primitive Permutation Groups

Let G be a permutation group acting on a set V . A partition π of V is distinguishing if the only element of G that fixes each cell of π is the identity. The distinguishing number of G is the minimum number of cells in a distinguishing partition. We prove that if G is a primitive permutation group and |V | ≥ 336, its distinguishing number is two.

On the Orders of Primitive Permutation Groups

The problem of bounding the order of a permutation group G in terms of its degree n was one of the central problems of 19th century group theory (see [4]). It is closely related to the 1860 Grand Prix problem of the Paris Academy, but its history goes in fact much further back (see e.g. [3], [1] and [10]). The heart of the problem is of course the case where G is a primitive group. The best res...

Factorizations of Primitive Permutation Groups

On rational groups with Sylow 2-subgroups of nilpotency class at most 2

A finite group $G$ is called rational if all its irreducible complex characters are rational valued. In this paper we discuss about rational groups with Sylow 2-subgroups of nilpotency class at most 2 by imposing the solvability and nonsolvability assumption on $G$ and also via nilpotency and nonnilpotency assumption of $G$.